Dominance rules in combinatorial optimization problems
نویسندگان
چکیده
منابع مشابه
Dominance rules in combinatorial optimization problems
The aim of this paper is to study the concept of a “dominance rule” in the context of combinatorial optimization. A dominance rule is established in order to reduce the solution space of a problem by adding new constraints to it, either in a procedure that aims to reduce the domains of variables, or directly in building interesting solutions. Dominance rules have been extensively used over the ...
متن کاملCombinatorial Problems in Compiler Optimization
Several important compiler optimizations such as instruction scheduling and register allocation are fundamentally hard and are usually solved using heuristics or approximate solutions. In contrast, this thesis examines optimal solutions to three combinatorial problems in compiler optimization. The first problem addresses instruction scheduling for clustered architectures, popular in embedded sy...
متن کاملOn Solving Combinatorial Optimization Problems
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...
متن کاملCombinatorial Optimization Problems with Testing
In stochastic versions of combinatorial optimization problems, the goal is to optimize an objective function under constraints that specify the feasible solutions, when some parameters involve uncertainty. We focus on maximizing a linear objective ∑N i=1Wixi, where x1, . . . , xN are the decision variables, W1, . . . ,WN are mutually independent random coefficients, and the constraints are dete...
متن کاملInapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2011
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2010.11.008